Pilot Assignment in Cell-Free Massive MIMO Based on the Hungarian Algorithm

This letter focuses on the problem of pilot assignment in cell-free massive MIMO systems. Exploiting well-known Hungarian algorithms, two procedures are proposed, one maximizing system throughput, and other fairness across users. The algorithms operate based knowledge large-scale fading coefficients as a proxy for distances between users system, take into account both uplink downlink performance. Numerical results show that proposed effective outperform many competing alternatives available literature.